Dynamic Programming 1 – Interactive Visualizers

Master overlapping subproblems and optimal substructure through intuitive DP visualizations.

Session 1 – Longest Common Subsequence

Understand recursive and memoized LCS computation.

Open Visualizer ↗

Session 1 – LCS (Plagiarism Detection)

Apply LCS logic to document similarity detection.

Open Visualizer ↗

Session 2 – Longest Increasing Subsequence

Visualize LIS using recursion and iterative DP methods.

Open Visualizer ↗

Session 2 – LIS (Optimized)

Compare naive recursion and optimized bottom-up approach.

Open Visualizer ↗

Session 3 – Subset Sum (Grocery Shopping)

Classic subset sum problem through an engaging scenario.

Open Visualizer ↗

Session 3 – Subset Sum (Charity Gifts)

Count the total ways to form sums using given items.

Open Visualizer ↗